Optimal design of hierarchical networks with free main path extremes

نویسندگان

  • Carlos Obreque
  • Vladimir Marianov
  • Miguel Rios
چکیده

We propose an optimal, two-stage procedure for the optimal design of minimum cost hierarchical spanning networks, consisting of a main path and secondary trees. The optimal location of the origin and destination nodes of the path is also found. We test our procedure and compare it with a known method. c © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

Doubly Optimal Secure and Protected Multicasting in Hierarchical Sensor Networks

This paper presents the research work addressing optimal secure and protected Multicasting in wired and wireless Hierarchical Sensor Networks (HSN). The multicast nodes in a hierarchical set up are associated with” Importance values” that are normalized into probabilities. The security constraint imposed is associated with the concept of “Prefix-free paths” in the associated graph. The optimali...

متن کامل

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

Neuro-Optimizer: A New Artificial Intelligent Optimization Tool and Its Application for Robot Optimal Controller Design

The main objective of this paper is to introduce a new intelligent optimization technique that uses a predictioncorrectionstrategy supported by a recurrent neural network for finding a near optimal solution of a givenobjective function. Recently there have been attempts for using artificial neural networks (ANNs) in optimizationproblems and some types of ANNs such as Hopfield network and Boltzm...

متن کامل

A discrete-event optimization framework for mixed-speed train timetabling problem

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2008